Restricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles
نویسنده
چکیده
In a previous paper we have investigated subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. In this paper we show that subsumption in EL (with or without cyclic definitions) remains polynomial even if one adds a certain restricted form of global role-value-maps to EL. In particular, this kind of role-value-maps can express transitivity of roles.
منابع مشابه
Terminological Cycles in a Description Logic with Existential Restrictions
Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles fo...
متن کاملLeast Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottom-up construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions les and msc to...
متن کاملExtracting ALEQR Self-Knowledge Bases from Graphs
A description graph is a directed graph that has labeled vertices and edges. This document proposes a method for extracting a knowledge base from a description graph. The technique is presented for the description logicALEQR , which allows for conjunctions, primitive negations, existential restrictions, value restrictions, qualified number restrictions, existential self restrictions, general co...
متن کاملExtracting ALEQR-Knowledge Bases from Graphs
A description graph is a directed graph that has labeled vertices and edges. This document proposes a method for extracting a knowledge base from a description graph. The technique is presented for the description logicALEQR which allows for conjunctions, primitive negation, existential restrictions, value restrictions, qualified number restrictions, existential self restrictions, and complex r...
متن کاملComputing Least Common Subsumer in Description Logics with Existential Restrictions Computing Least Common Subsumer in Description Logics with Existential Restrictions
Computing the least common subsumer (lcs) is an inference task that can be used to support the \bottom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main new contribution of this paper is the treat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003